Game Theory Based Coevolutionary Algorithm: A New Computational Coevolutionary Approach
نویسندگان
چکیده
Game theory is a method of mathematical analysis developed to study the decision making process. In 1928, Von Neumann mathematically proved that every two-person, zerosum game with many pure finite strategies for each player is deterministic. In the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann’s theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) as introduced by Maynard Smith in 1982. Keeping pace with these game theoretical studies, the first computer simulation of coevolution was tried out by Hillis. Moreover, Kauffman proposed the NK model to analyze coevolutionary dynamics between different species. He showed how coevolutionary phenomenon reaches static states and that these states are either Nash equilibrium or ESS in game theory. Since studies concerning coevolutionary phenomenon were initiated, there have been numerous other researchers who have developed coevolutionary algorithms. In this paper we propose a new coevolutionary algorithm named Game theory based Coevolutionary Algorithm (GCEA) and we confirm that this algorithm can be a solution of evolutionary problems by searching the ESS. To evaluate this newly designed approach, we solve several test Multiobjective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by the coevolutionary algorithm and analyze the optimization performance of our algorithm by comparing the performance of our algorithm with that of other evolutionary optimization algorithms.
منابع مشابه
Analyzing Cooperative Coevolution with Evolutionary Game Theory
The task of understanding coevolutionary algorithms is a very difficult one. These algorithms search landscapes which are in some sense adaptive. As a result, the dynamical behaviors of coevolutionary systems can frequently be even more complex than traditional evolutionary algorithms (EAs). Moreover, traditional EA theory tells us little about coevolutionary algorithms. One major question that...
متن کاملCyclic Dominance in the Spatial Coevolutionary Optional Prisoner's Dilemma Game
This paper studies scenarios of cyclic dominance in a coevolutionary spatial model in which game strategies and links between agents adaptively evolve over time. The Optional Prisoner’s Dilemma (OPD) game is employed. The OPD is an extended version of the traditional Prisoner’s Dilemma where players have a third option to abstain from playing the game. We adopt an agent-based simulation approac...
متن کاملFuzzy Logic Resource Management and Coevolutionary Game-based Optimization
Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including...
متن کاملDistributed Evolutionary Optimization, in Manifold: Rosenbrock's Function Case Study
A competitive coevolutionary approach using loosely coupled genetic algorithms is applied to the distributed optimization of the Rosenbrock's function. The computational scheme is a coevolutionary system of agents with only local interactions among them, without any central synchronization. We show that the distributed optimization algorithm implemented in the new coordination language Manifold...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004